Completing simple valuations in -categories
نویسندگان
چکیده
We prove that Keimel and Lawson's K-completion Kc of the simple valuation monad Vs defines a Kc∘Vs on each -category K. also characterise Eilenberg-Moore algebras as weakly locally convex K-cones, its algebra morphisms continuous linear maps. In addition, we explicitly describe distributive law over Kc, which allows us to show any (resp., convex, linear) topological cone is K-cone. give an example – Cantor tree with top shows dcpo-completion valuations not D-completion in general, where D category monotone convergence spaces
منابع مشابه
An Integral Geometric Theorem for Simple Valuations
We prove a translative mean value formula for simple valuations, taken at the intersection of a fixed and a translated convex body. MSC 2000: 52A22 (primary); 52B45 (secondary)
متن کامل-categories with Non-simple Units
We study the general structure of 2-C∗ -categories closed under conjugation, projections and direct sums. We do not assume units to be simple, i.e. for ιA the 1-unit corresponding to an object A , the space Hom(ιA, ιA) is a commutative unital C∗ -algebra. We show that 2-arrows can be viewed as continuous sections in Hilbert bundles and describe the behaviour of the fibres with respect to the ca...
متن کاملA Simple Method for Completing Degenerate Delaunay Tessellations
We characterize the conditions under which completing a Delaunay tessellation produces a connguration that is a nondegenerate Delaunay triangulation of an arbitrarily small perturbation of the original sites. One consequence of this result is a simple postpro-cessing step for resolving degeneracies in Delaunay triangulations that does not require symbolic perturbation of the data. We also give ...
متن کاملCompleting the Brauer Trees for the Sporadic Simple Lyons Group
In this paper we complete the Brauer trees for the sporadic simple Lyons group Ly in characteristics 37 and 67. The results are obtained using tools from computational representation theory, in particular a new condensation technique, and with the assistance of the computer algebra systems MeatAxe and GAP.
متن کاملSimple and Efficient Budget Feasible Mechanisms for Monotone Submodular Valuations
We study the problem of a budget limited buyer who wants to buy a set of items, each from a different seller, to maximize her value. The budget feasible mechanism design problem aims to design a mechanism which incentivizes the sellers to truthfully report their cost, and maximizes the buyer’s value while guaranteeing that the total payment does not exceed her budget. Such budget feasible mecha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2022
ISSN: ['1879-3207', '0166-8641']
DOI: https://doi.org/10.1016/j.topol.2022.108192